Peer-assisted content distribution on a budget

نویسندگان

  • Pietro Michiardi
  • Damiano Carra
  • Francesco Albanese
  • Azer Bestavros
چکیده

In this paper, we propose a general framework and present a prototype implementation of peer-assisted content delivery application. Our system – called Cyclops – dynamically adjusts the bandwidth consumed by content servers (which represents the bulk of content delivery costs) to feed a set of swarming clients, based on a feedback signal that gauges the real-time health of the swarm. Our extensive evaluation of Cyclops in a variety of settings – including controlled PlanetLab and live Internet experiments involving thousands of users – shows a significant reduction in content distribution costs when compared to existing swarming solutions, with a minor impact on the content delivery times.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Survey on peer-assisted content delivery networks

Peer-assisted content delivery networks have recently emerged as an economically viable alternative to traditional content delivery approaches: the feasibility studies conducted for several large content providers suggested a remarkable potential of peer-assisted content delivery networks to reduce the burden of user requests on content delivery servers and several commercial peer-assisted depl...

متن کامل

Making Contribution-Aware Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles

Many peer-assisted content-distribution systems reward a peer based on the amount of datathat this peer serves to others. However, validating that a peer did so is, to our knowledge, anopen problem; e.g., a group of colluding attackers can earn rewards by claiming to have servedcontent to one another, when they have not. We propose a bandwidth puzzle mechanism tomake contributio...

متن کامل

Making Peer-Assisted Content Distribution Robust to Collusion Using Bandwidth Puzzles

Many peer-assisted content-distribution systems reward a peer based on the amount of data that this peer serves to others. However, validating that a peer did so is, to our knowledge, an open problem; e.g., a group of colluding attackers can earn rewards by claiming to have served content to one another, when they have not. We propose a puzzle mechanism to make contribution-aware peer-assisted ...

متن کامل

Peer Assisted Content Distribution over Router Assisted Overlay Multicast

While multicasting is considered valuable for content distribution, it is not widely supported on the Internet, despite the emergence of scalable overlay schemes. Content providers have instead turned to peer assisted content distribution in order to efficiently serve large numbers of clients, thus removing the bandwidth bottleneck from their side but placing a heavy burden on the clients. Even...

متن کامل

Economics of a Collaborative Peer-to- Peer Infrastructure for Content Distribution

Abstracl Distributing digiwl media contents to a large number of users in a cost-effective manner is a challenging task for the content provider. Traditionally, the content provider either deploys a set of high capaciry servers or contracts a content delivery network (CDN) to transport contents to users. The first approach requires a significant investment to set up and administer the servers. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Networks

دوره 56  شماره 

صفحات  -

تاریخ انتشار 2012